Reportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
نویسندگان
چکیده
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the niteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized niteness conditions. The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating diierent semantic models for a given language based on the results is presented.
منابع مشابه
Generalized Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image com...
متن کاملRelating Coalgebraic Notions of Bisimulation
A labelled transition system can be understood as a coalgebra for a particular endofunctor on the category of sets. Generalizing, we are led to consider coalgebras for arbitrary endofunctors on arbitrary categories. Bisimulation is a crucial notion in the theory of labelled transition systems. We identify four definitions of bisimulation on general coalgebras. The definitions all specialize to ...
متن کاملA Petri Net Interpretation of Open Reconfigurable Systems
We present a Petri net interpretation of the pi-graphs a graphical variant of the pi-calculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the t...
متن کاملModels for Name-Passing Processes: Interleaving and Causal
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual π-calculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving...
متن کاملLabelled Execution Systems
Interleaving theories have traditionally failed to integrate a satisfactory treatment of the so-called “finite delay property”. This is generally attributed to the expansion law of such theories, but actually, the problem is rooted in the concept of labelled transition system. We introduce a new type of system, in which, instead of labelled transitions, we have, essentially, sequences of labell...
متن کامل